Parallel Best-First Search: The Role of Abstraction
نویسندگان
چکیده
ion in PRA* Introduction PRA* PBNF Optimal Search ■ Domains ■ APRA* ■ Grid Pathfinding ■ Sliding Tiles ■ Planning ■ Summary Suboptimal Search Conclusion Ethan Burns (UNH) Abstraction in Multicore Heuristic Search – 17 / 31 Grid Unit Four-way 5000x5000 w a l l t i m e ( s e c o n d s ) 20
منابع مشابه
ارزیابی رابطه SCS در تعیین تلفات اولیه باران در حوضه های آبریز
The main scope of this research is evaluation of Soil Conservation Service Procedure in derivation of initial abstraction of precipitation in watershed scale. For this purpose Dalaki watershed which is located in south east of Iran was selected then by using hec-hms and GIS models and a number of observed rainfall runoff events some parameters like CN of watershed ,K and X of Muskingam meth...
متن کاملA Graph-Partitioning Based Approach for Parallel Best-First Search
Parallel best-first search algorithms such as HDA* distribute work among the processes using a global hash function. Previous work distribution strategies seek to find a good walltime efficiency by reducing search overhead and/or communication overhead, but there was no unified, quantitative analysis on the effects of the methods on both overheads. We propose GRAZHDA*, a graph-partitioning base...
متن کاملOn Hash-Based Work Distribution Methods for Parallel Best-First Search
Parallel best-first search algorithms such as Hash Distributed A* (HDA*) distribute work among the processes using a global hash function. We analyze the search and communication overheads of state-of-the-art hash-based parallel best-first search algorithms, and show that although Zobrist hashing, the standard hash function used by HDA*, achieves good load balance for many domains, it incurs si...
متن کاملNew Formulation and Solution in PCB Assembly Systems with Parallel Batch processors
This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...
متن کاملParallel Best-First Search: Optimal and Suboptimal Solutions
To harness modern multi-core processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we present a general approach to best-first heuristic search in a shared-memory setting. Each thread attempts to expand the most promising nodes. By using abstraction to partition the state space, we detect duplicate states while avoiding lock contention. We allow spe...
متن کامل